Unsupervised co-segmentation of a set of shapes via descriptor-space spectral clustering
نویسندگان
چکیده
منابع مشابه
Unsupervised Co-Segmentation of a Set of Shapes ia Descriptor-Space Spectral Clustering: upplementary Material
(a) [Golovinskiy and Funkhouser 2009] (b) Our co-segmentation method Figure 1: Comparison of an approach based on alignment (a), to our approach based on descriptor-space clustering (b). By contrasting these co-segmentation results, we observe that the results in (a) are less meaningful for sets of shapes that have greater part variability.
متن کاملUnsupervised Co-Segmentation of a Set of Shapes ia Descriptor-Space Spectral Clustering
We introduce an algorithm for unsupervised co-segmentation of a set of shapes so as to reveal the semantic shape parts and establish their correspondence across the set. The input set may exhibit significant shape variability where the shapes do not admit proper spatial alignment and the corresponding parts in any pair of shapes may be geometrically dissimilar. Our algorithm can handle such cha...
متن کاملUnsupervised co-segmentation of 3D shapes via affinity aggregation spectral clustering
Many shape co-segmentation methods employ multiple descriptors to measure the similarities between parts of a set of shapes in a descriptor space. Different shape descriptors characterize a shape in different aspects. Simply concatenating them into a single vector might greatly degrade the performance of the co-analysis in the presence of irrelevant and redundant information. In this paper, we ...
متن کاملUnsupervised Co-segmentation of 3D Shapes via Functional Maps
We present an unsupervised method for co-segmentation of a set of 3D shapes from the same class with the aim of segmenting the input shapes into consistent semantic parts and establishing their correspondence across the set. Starting from meaningful pre-segmentation of all given shapes individually, we construct the correspondence between same candidate parts and obtain the labels via functiona...
متن کاملCo-Segmentation of 3D Shapes via Subspace Clustering
We present a novel algorithm for automatically co-segmenting a set of shapes from a common family into consistent parts. Starting from over-segmentations of shapes, our approach generates the segmentations by grouping the primitive patches of the shapes directly and obtains their correspondences simultaneously. The core of the algorithm is to compute an affinity matrix where each entry encodes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2011
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2070781.2024160